0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.14/0.35 % Computer : n020.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 1200 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Jul 13 15:13:21 EDT 2021 0.14/0.36 % CPUTime : 0.14/0.36 % Number of cores: 8 0.14/0.36 % Python version: Python 3.6.8 0.14/0.36 # Version: 2.6rc1-ho 0.14/0.37 # No SInE strategy applied 0.14/0.37 # Trying AutoSched0 for 59 seconds 0.21/0.44 # AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S06DN 0.21/0.44 # and selection function SelectNewComplexAHPExceptUniqMaxHorn. 0.21/0.44 # 0.21/0.44 # Preprocessing time : 0.061 s 0.21/0.44 # Presaturation interreduction done 0.21/0.44 0.21/0.44 # Proof found! 0.21/0.44 # SZS status Theorem 0.21/0.44 # SZS output start CNFRefutation 0.21/0.44 thf(fact_3_deriv__id, axiom, (deriv_complex @ id_complex)=(^[X374:complex]:one_one_complex), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_deriv__id)). 0.21/0.44 thf(conj_0, conjecture, (deriv_complex @ id_complex @ w)=(one_one_complex), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.21/0.44 thf(c_0_2, plain, ![X374:complex]:(deriv_complex @ id_complex @ X374)=(one_one_complex), inference(fof_simplification,[status(thm)],[fact_3_deriv__id])). 0.21/0.44 thf(c_0_3, negated_conjecture, (deriv_complex @ id_complex @ w)!=(one_one_complex), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.21/0.44 thf(c_0_4, plain, ![X1924:complex]:(deriv_complex @ id_complex @ X1924)=(one_one_complex), inference(variable_rename,[status(thm)],[c_0_2])). 0.21/0.44 thf(c_0_5, negated_conjecture, (deriv_complex @ id_complex @ w)!=(one_one_complex), inference(split_conjunct,[status(thm)],[c_0_3])). 0.21/0.44 thf(c_0_6, plain, ![X16:complex]:(deriv_complex @ id_complex @ X16)=(one_one_complex), inference(split_conjunct,[status(thm)],[c_0_4])). 0.21/0.44 thf(c_0_7, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])]), ['proof']). 0.21/0.44 # SZS output end CNFRefutation 0.21/0.44 # Proof object total steps : 8 0.21/0.44 # Proof object clause steps : 3 0.21/0.44 # Proof object formula steps : 5 0.21/0.44 # Proof object conjectures : 4 0.21/0.44 # Proof object clause conjectures : 2 0.21/0.44 # Proof object formula conjectures : 2 0.21/0.44 # Proof object initial clauses used : 2 0.21/0.44 # Proof object initial formulas used : 2 0.21/0.44 # Proof object generating inferences : 0 0.21/0.44 # Proof object simplifying inferences : 2 0.21/0.44 # Training examples: 0 positive, 0 negative 0.21/0.44 # Parsed axioms : 433 0.21/0.44 # Removed by relevancy pruning/SinE : 0 0.21/0.44 # Initial clauses : 652 0.21/0.44 # Removed in clause preprocessing : 125 0.21/0.44 # Initial clauses in saturation : 527 0.21/0.44 # Processed clauses : 5 0.21/0.44 # ...of these trivial : 0 0.21/0.44 # ...subsumed : 0 0.21/0.44 # ...remaining for further processing : 5 0.21/0.44 # Other redundant clauses eliminated : 0 0.21/0.44 # Clauses deleted for lack of memory : 0 0.21/0.44 # Backward-subsumed : 0 0.21/0.44 # Backward-rewritten : 1 0.21/0.44 # Generated clauses : 0 0.21/0.44 # ...of the previous two non-trivial : 0 0.21/0.44 # Contextual simplify-reflections : 0 0.21/0.44 # Paramodulations : 0 0.21/0.44 # Factorizations : 0 0.21/0.44 # NegExts : 0 0.21/0.44 # Equation resolutions : 0 0.21/0.44 # Propositional unsat checks : 0 0.21/0.44 # Propositional check models : 0 0.21/0.44 # Propositional check unsatisfiable : 0 0.21/0.44 # Propositional clauses : 0 0.21/0.44 # Propositional clauses after purity: 0 0.21/0.44 # Propositional unsat core size : 0 0.21/0.44 # Propositional preprocessing time : 0.000 0.21/0.44 # Propositional encoding time : 0.000 0.21/0.44 # Propositional solver time : 0.000 0.21/0.44 # Success case prop preproc time : 0.000 0.21/0.44 # Success case prop encoding time : 0.000 0.21/0.44 # Success case prop solver time : 0.000 0.21/0.44 # Current number of processed clauses : 4 0.21/0.44 # Positive orientable unit clauses : 1 0.21/0.44 # Positive unorientable unit clauses: 0 0.21/0.44 # Negative unit clauses : 3 0.21/0.44 # Non-unit-clauses : 0 0.21/0.44 # Current number of unprocessed clauses: 522 0.21/0.44 # ...number of literals in the above : 1198 0.21/0.44 # Current number of archived formulas : 0 0.21/0.44 # Current number of archived clauses : 1 0.21/0.44 # Clause-clause subsumption calls (NU) : 0 0.21/0.44 # Rec. Clause-clause subsumption calls : 0 0.21/0.44 # Non-unit clause-clause subsumptions : 0 0.21/0.44 # Unit Clause-clause subsumption calls : 1 0.21/0.44 # Rewrite failures with RHS unbound : 0 0.21/0.44 # BW rewrite match attempts : 1 0.21/0.44 # BW rewrite match successes : 1 0.21/0.44 # Condensation attempts : 0 0.21/0.44 # Condensation successes : 0 0.21/0.44 # Termbank termtop insertions : 38760 0.21/0.44 0.21/0.44 # ------------------------------------------------- 0.21/0.44 # User time : 0.068 s 0.21/0.44 # System time : 0.008 s 0.21/0.44 # Total time : 0.076 s 0.21/0.44 # Maximum resident set size: 2376 pages 0.21/0.44 EOF